Maximum Margin Matrix Factorization with Netflix Data
نویسنده
چکیده
Maximum Margin Matrix Factorization (MMMF), a collaborative filtering method, was recently introduced in [7] followed by an iterative solution presented in [6]. In this paper we analyze the performance of MMMF on a subset of the Netflix data based on RMSE and classification rate. We also present several modifications to improve the performance of the algorithm on the Netflix problem.
منابع مشابه
Collaborative Filtering via Ensembles of Matrix Factorizations
We present a Matrix Factorization (MF) based approach for the Netflix Prize competition. Currently MF based algorithms are popular and have proved successful for collaborative filtering tasks. For the Netflix Prize competition, we adopt three different types of MF algorithms: regularized MF, maximum margin MF and non-negative MF. Furthermore, for each MF algorithm, instead of selecting the opti...
متن کاملMatrix completion and low-rank SVD via fast alternating least squares
The matrix-completion problem has attracted a lot of attention, largely as a result of the celebrated Netflix competition. Two popular approaches for solving the problem are nuclear-norm-regularized matrix approximation (Candès and Tao, 2009; Mazumder et al., 2010), and maximum-margin matrix factorization (Srebro et al., 2005). These two procedures are in some cases solving equivalent problems,...
متن کاملMatrix factorization for the Netflix Prize
I compare two common techniques to compute matrix factorizations for recommender systems, specifically using the Netflix prize data set. Accuracy, run-time, and scalability are discussed for stochastic gradient descent and non-linear conjugate gradient.
متن کاملClustering-Based Matrix Factorization (under review)
Recommender systems are emerging technologies that nowadays can be found in many applications such as Amazon, Netflix, and so on. These systems help users find relevant information, recommendations, and their preferred items. Matrix Factorization is a popular method in Recommendation Systems showing promising results in accuracy and complexity. In this paper we propose an extension of matrix fa...
متن کاملSparse Learning via Maximum Margin Matrix Factorization
In this paper, an algorithm for sparse learning via Maximum Margin Matrix Factorization(MMMF) is proposed. The algorithm is based on L1 penality and Alternating Direction Method of Multipliers. It shows that with sparse factors, sparse factors method can obtain result as good as dense factors.
متن کامل